Solving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem

نویسندگان

  • Elisabeth Zehendner
  • Nabil Absi
  • Stéphane Dauzère-Pérès
  • Dominique Feillet
چکیده

Continuously increasing global container trade and pressure from a limited number of large shipping companies are enforcing the need for efficient container terminals. By using internal material handling resources efficiently, transfer times and operating costs are reduced. We focus our study on container terminals using straddle carriers for transportation and storage operations. We assume that straddle carriers are shared among maritime and inland transport modes (truck, train, barge). The problem is thus to decide how many resources to allocate to each transport mode in order to minimize vehicle (vessel, truck, train, barge) delays. We present a mixed integer linear programming model, based on a network flow representation, to solve this allocation problem. The modular structure of the model enables us to represent different container terminals, transport modes and service strategies. We present parts of our model and exemplary applications for a terminal at the “Grand Port Maritime de Marseille” in France.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Allocation of Ships to Quay Length in Container Ports

Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS

Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

متن کامل

Distributed Simulation-based Optimization for Resource Allocation of Multimodal Operation System on Container Terminals

Faculty of Symbiotic Systems Science, Fukushima University, Fukushima City, 960-1296, Japan This paper focuses on efficiency of simulation-based optimization for container terminal operation system. Firstly, the discrete-event simulation model of multimodal operation system on container terminal was presented with the queuing network, for which the mathematical optimization model of resource al...

متن کامل

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011